The Height of a Random Binary Search Tree BRUCE REED McGill University, Montreal Quebec, Canada and CNRS, Paris, France Abstract. Let Hn be the height of a random binary search tree on n nodes. We show that there exist c

Source URL: cgm.cs.mcgill.ca

Spanning Tree Approximations for Conditional Random Fields Patrick Pletscher Department of Computer Science ETH Zurich, Switzerland

Source URL: www.pletscher.org

Sampling-based Path Planning on Configuration-Space Costmaps L´eonard Jaillet, Juan Cort´es and Thierry Sim´eon Abstract—This paper addresses path planning considering a cost function defined over the configuration

Source URL: homepages.laas.fr

• Search algorithms
• Mathematics
• Routing algorithms
• Information science
• Information retrieval
• Edsger W. Dijkstra
• Combinatorial optimization
• Robot navigation
• A* search algorithm
• Shortest path problem
• Motion planning
• Rapidly-exploring random tree

A Decision Tree Framework for Spatiotemporal Sequence Prediction Taehwan Kim Yisong Yue

Source URL: www.yisongyue.com

• Machine learning
• Conditional random field
• Structured prediction
• Hidden Markov model
• Artificial neural network
• Dynamic programming
• Decision tree learning
• Pattern recognition
• Recursion
• Supervised learning

arXiv:1104.2132v2 [math.CO] 15 FebOn the tree–depth of random graphs ∗ G. Perarnau and O.Serra February 16, 2012

Source URL: arxiv.org

Spanning Trees in Random Graphs Richard Montgomery (University of Cambridge) Given a tree T with n vertices, how large does p need to be for it to be likely that a copy of T appears in the binomial random graph G(n, p)?

Source URL: web.mat.bham.ac.uk

Continuous Arvand: Motion Planning with Monte Carlo Random Walks ¨ Weifeng Chen and Martin Muller Department of Computing Science University of Alberta {weifeng3,mmueller}@ualberta.ca

Source URL: webdocs.cs.ualberta.ca

• Statistics
• Applied mathematics
• Search algorithms
• Stochastic processes
• Motion planning
• Rapidly-exploring random tree
• Random walk
• Probabilistic roadmap
• Urban planning
• Theoretical computer science
• Robot control
• Geography of Asia

Some New Methods and Results in Tree Enumeration A. M. Odlyzko Bell Laboratories Murray Hill, New JerseyIntroduction A wide variety of new results in combinatorial enumeration have been obtained

Source URL: www.dtc.umn.edu

• Operator theory
• Integer sequences
• Random permutation statistics
• Lagrange inversion theorem
• Mathematics
• Mathematical analysis
• Combinatorics

PageRank and random walks on graphs Fan Chung and Wenbo Zhao University of California, San Diego La Jolla, CA 92093, US {fan,pedu,w3zhao}@ucsd.edu

Source URL: www.math.ucsd.edu

• Matrix theory
• PageRank
• Reputation management
• Search engine optimization
• Tree
• Eigenvalues and eigenvectors
• Theorems and definitions in linear algebra
• Covering graph
• Algebra
• Mathematics
• Linear algebra

S OME R ESEARCH T OPICS FOR S TUDENTS Quentin F. Stout Here’s a quick overview of some research topics I’m interested in. I’ve also worked with many students that initiated their own project. If yo

Source URL: web.eecs.umich.edu

• Parallel computing
• Spanning tree
• Analysis of algorithms
• Search algorithms
• Parallel algorithm
• Algorithm
• Genetic algorithm
• Parallel Random Access Machine
• Minimum spanning tree
• Theoretical computer science
• Concurrent computing
• Applied mathematics